A note on local and global convergence analysis of iterative aggregation-disaggregation methods

نویسندگان

  • Ivo Marek
  • Ivana Pultarová
چکیده

The purpose of the paper is to present some convergence properties of the iterative aggregation-disaggregation method for computing a stationary probability distribution vector of a column stochastic matrix. A sufficient condition for the local convergence property and the corresponding rate of convergence are established. Some global convergence considerations are presented. Several illustrative examples are included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Necessary and sufficient local convergence condition of one class of iterative aggregation-disaggregation methods

The paper concludes one part of the local convergence analysis of a certain class of iterative aggregation-disaggregation methods for computing a stationary probability distribution vector of a stochastic matrix B. We show that the local convergence of the algorithm is determined by the sparsity pattern of the matrix and by the choice of the aggregation groups. We introduce the asymptotic conve...

متن کامل

Ela Error Propagation Formula of Multi-level Iterative Aggregation-disaggregation Methods for Non-symmetric Problems

Iterative aggregation-disaggregation methods for numerical computing of stationary probability distribution vectors of stochastic matrices are studied. The methods can use arbitrary numbers of levels and of smoothing steps. A formula for the error propagation is derived. Using this formula, some asymptotic convergence properties of these methods for non-symmetric problems are demonstrated.

متن کامل

Coupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material

This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...

متن کامل

Iterative aggregation: disaggregation methods and ordering algorithms

The paper presents some modifications of two-level methods for computing stationary probability distribution vector of large discrete time Markov chains. The approach considered is an iterative aggregation disaggregation method. Two types of permuting the events are considered in order to improve the convergence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005